Hyperplane Arrangements: Computations and Conjectures

نویسنده

  • Hal Schenck
چکیده

This paper provides an overview of selected results and open problems in the theory of hyperplane arrangements, with an emphasis on computations and examples. We give an introduction to many of the essential tools used in the area, such as Koszul and Lie algebra methods, homological techniques, and the Bernstein-Gelfand-Gelfand correspondence, all illustrated with concrete calculations. We also explore connections of arrangements to other areas, such as De Concini-Procesi wonderful models, the Feichtner-Yuzvinsky algebra of an atomic lattice, fatpoints and blowups of projective space, and plane curve singularities.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Combinatorial Generation of Small Point Configurations and Hyperplane Arrangements

A recent progress on the complete enumeration of oriented matroids enables us to generate all combinatorial types of small point configurations and hyperplane arrangements in general dimension, including degenerate ones. This extends a number of former works which concentrated on the non-degenerate case and are usually limited to dimension 2 or 3. Our initial study on the complete list for smal...

متن کامل

Complete combinatorial generation of small point configurations and hyperplane arrangements

A recent progress on the complete enumeration of oriented matroids enables us to generate all combinatorial types of small point configurations and hyperplane arrangements in general dimension, including degenerate ones. This extends a number of former works which concentrated on the nondegenerate case and are usually limited to dimension 2 or 3. Our initial study on the complete list for small...

متن کامل

Tutte polynomials of hyperplane arrangements and the finite field method

The Tutte polynomial is a fundamental invariant associated to a graph, matroid, vector arrangement, or hyperplane arrangement, which answers a wide variety of questions about its underlying object. This short survey focuses on some of the most important results on Tutte polynomials of hyperplane arrangements. We show that many enumerative, algebraic, geometric, and topological invariants of a h...

متن کامل

A Nearly Quadratic Bound for the Decision Tree Complexity of k-SUM

We show that the k-SUM problem can be solved by a linear decision tree of depth O(n2 log2 n), improving the recent bound O(n3 log3 n) of Cardinal et al. [7]. Our bound depends linearly on k, and allows us to conclude that the number of linear queries required to decide the n-dimensional Knapsack or SubsetSum problems is only O(n3 logn), improving the currently best known bounds by a factor of n...

متن کامل

Affine and Toric Hyperplane Arrangements

We extend the Billera–Ehrenborg–Readdy map between the intersection lattice and face lattice of a central hyperplane arrangement to affine and toric hyperplane arrangements. For arrangements on the torus, we also generalize Zaslavsky’s fundamental results on the number of regions.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2009